Analysis of Iterative Deepening A* Algorithm
نویسندگان
چکیده
منابع مشابه
Iterative Deepening Multiobjective A
Many real-world optimization problems involve multiple objectives which are often conflicting. When conventional heuristic search algorithms such as A* and IDA* are used for solving such problems, then these problems have to be modeled as simple cost minimization or maximization problems. The task of modeling such problems using a single valued criterion has often proved difficult [6]. The prob...
متن کاملEnhanced Iterative-Deepening Search
|Iterative-deepening searchesmimic a breadthrst node expansion with a series of depthrst searches that operate with successively extended search horizons. They have been proposed as a simple way to reduce the space complexity of bestrst searches like A* from exponential to linear in the search depth. But there is more to iterative-deepening than just a reduction of storage space. As we show, th...
متن کاملAdaptive Parallel Iterative Deepening
Many of the artiicial intelligence techniques developed to date rely on heuristic search through large spaces. Unfortunately, the size of these spaces and the corresponding computational eeort reduce the applicability of otherwise novel and eeective algorithms. A number of parallel and distributed approaches to search have considerably improved the performance of the search process. Our goal is...
متن کاملAdaptive Parallel Iterative Deepening Search
Many of the artiicial intelligence techniques developed to date rely on heuristic search through large spaces. Unfortunately, the size of these spaces and the corresponding computational eeort reduce the applicability of otherwise novel and eeective algorithms. A number of parallel and distributed approaches to search have considerably improved the performance of the search process. Our goal is...
متن کاملSoundness Proofs for Iterative Deepening
The Iterative Deepening algorithm allows stateless model checkers to adjust preemption points on-the-fly. It uses dynamic data-race detection to avoid necessarily preempting on every shared memory access, and ignores false-positive data race candidates arising from certain heap allocation patterns. An Iterative Deepening test that reaches completion soundly verifies all possible thread interlea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Earth and Environmental Science
سال: 2021
ISSN: 1755-1307,1755-1315
DOI: 10.1088/1755-1315/693/1/012028